Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2 – 13
نویسنده
چکیده
We count the number of permutations with k occurrences of the pattern 2–13 in permutations by lattice path enumeration. We give closed forms for k ≤ 8, extending results of Claesson and Mansour.
منابع مشابه
Enumeration of Permutations Containing a Prescribed Number of Occurrences of a Pattern of Length 3
We consider the problem of enumerating the permutations containing exactly k occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bij...
متن کاملPermutations with Restricted Patterns and Dyck Paths
We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12 . . . k follow directly from old results on the enumeration of Motzkin paths, among which is a continued fraction result due to Flajolet. As a...
متن کامل2 7 N ov 2 00 8 Matrix Ansatz , lattice paths and rook placements
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with respect to the number of ascents and occurrence...
متن کاملApproaches for enumerating permutations with a prescribed number of occurrences of patterns
Abstract. In recent work, Zeilberger and the author used a functional equations approach for enumerating permutations with r occurrences of the pattern 12 . . . k. In particular, the approach yielded a polynomial-time enumeration algorithm for any xed r ≥ 0. We extend that approach to patterns of the form 12 . . . (k − 2)(k)(k − 1) by deriving analogous functional equations and using them to de...
متن کاملTHESIS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Permutation patterns, continued fractions, and a group determined by an ordered set
We present six articles: In the first and second article we give the first few results on generalized pattern avoidance, focusing on patterns of type (1, 2) or (2, 1). There are twelve such patterns, and they fall into three classes with respect to being equidistributed. We use 1 23, 1 32, and 2 13 as representatives for these classes. We prove that |Sn(1 23)| = |Sn(1 32)| = Bn and |Sn(2 13)| =...
متن کامل